The Cross-Entropy Method for Combinatorial and Continuous Optimization

نویسندگان

  • Reuven Rubinstein
  • William Davidson
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Cross-Entropy Method for Optimization

The cross-entropy method is a versatile heuristic tool for solving difficult estimation and optimization problems, based on Kullback–Leibler (or cross-entropy) minimization. As an optimization method it unifies many existing populationbased optimization heuristics. In this chapter we show how the cross-entropy method can be applied to a diverse range of combinatorial, continuous, and noisy opti...

متن کامل

Cross-Entropy Method

The cross-entropy method is a recent versatile Monte Carlo technique. This article provides a brief introduction to the cross-entropy method and discusses how it can be used for rare-event probability estimation and for solving combinatorial, continuous, constrained and noisy optimization problems. A comprehensive list of references on cross-entropy methods and applications is included.

متن کامل

A Tutorial on the Cross-Entropy Method

The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal optimization and rare event simulation. The purpose of this tutorial is to give a gentle introduction to the CE method. We present the CE methodology, the basic algorithm and its modifications, and discuss applications in combinatorial optimization and machine learning.

متن کامل

The Cross-Entropy Method

This report is a summary of the theory underlying the Cross-Entropy (CE) method, as discussed in the tutorial by de Boer, Kroese, Mannor and Rubinstein [1]. For a more thorough discussion of the method and its applications, please refer to the original tutorial and the references cited in the tutorial. The CE method, pioneered by Rubinstein in 1997 as an adaptive algorithm for estimating probab...

متن کامل

The Accelerated Cross Entropy Method: An Application to the Max-Cut Problem

Cross entropy has recently been proposed as a heuristic method for solving combinatorial optimization problems. We briefly review this methodology and then suggest modifications and extensions with the goal of improving its performance. In the context of the well-known max-cut problem, we compare an implementation of the original cross entropy method with our proposed accelerated version. The s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999